Monte Carlo Approaches to Parameterized Poker Squares
نویسندگان
چکیده
Parameterized Poker Squares (PPS) is a generalization of Poker Squares where players must adapt to a point system supplied at play time and thus dynamically compute highly-varied strategies. Herein, we detail the top three performing AI players in a PPS research competition, all three of which make various use of Monte Carlo techniques.
منابع مشابه
BeeMo, a Monte Carlo Simulation Agent for Playing Parameterized Poker Squares
We investigated Parameterized Poker Squares to approximate an optimal game playing agent. We organized our inquiry along three dimensions: partial hand representation, search algorithms, and partial hand utility learning. For each dimension we implemented and evaluated several designs, among which we selected the best strategies to use for BeeMo, our final product. BeeMo uses a parallel flat Mo...
متن کاملLearning and Using Hand Abstraction Values for Parameterized Poker Squares
We describe the experimental development of an AI player that adapts to different point systems for Parameterized Poker Squares. After introducing the game and research competition challenge, we describe our static board evaluation utilizing learned evaluations of abstract partial Poker hands. Next, we evaluate various time management strategies and search algorithms. Finally, we show experimen...
متن کاملAn Exploitative Monte-Carlo Poker Agent
We describe the poker agent AKI-REALBOT which participated in the 6-player Limit Competition of the third Annual AAAI Computer Poker Challenge in 2008. It finished in second place, its performance being mostly due to its superior ability to exploit weaker bots. This paper describes the architecture of the program and the Monte-Carlo decision tree-based decision engine that was used to make the ...
متن کاملIntegrating Opponent Models with Monte-Carlo Tree Search in Poker
In this paper we apply a Monte-Carlo Tree Search implementation that is boosted with domain knowledge to the game of poker. More specifically, we integrate an opponent model in the Monte-Carlo Tree Search algorithm to produce a strong poker playing program. Opponent models allow the search algorithm to focus on relevant parts of the game-tree. We use an opponent modelling approach that starts f...
متن کاملNSG Challenge: Parameterized Poker Squares
Copyright c © 2014, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved. Whereas DARPA has its “grand challenges”, ours are not so grand. http://www.boardgamegeek.com/boardgame/ 41215/poker-squares, http://cs.gettysburg. edu/ ̃tneller/games/pokersquares http://www.boardgamegeek.com/geeklist/ 152237/sequential-placement-optimization-games You may conside...
متن کامل